Deciding Parity of Graph Crossing Number
نویسندگان
چکیده
منابع مشابه
Deciding Parity of Graph Crossing Number∗
We prove that it is NP-hard to determine whether the crossing number of an input graph is even or odd.
متن کاملvertex centered crossing number for maximal planar graph
the crossing number of a graph is the minimum number of edge crossings over all possible drawings of in a plane. the crossing number is an important measure of the non-planarity of a graph, with applications in discrete and computational geometry and vlsi circuit design. in this paper we introduce vertex centered crossing number and study the same for maximal planar graph.
متن کاملDeciding the Bell Number for Hereditary Graph Properties - (Extended Abstract)
A graph property is a set of graphs closed under isomorphism. A property is hereditary if it is closed under taking induced subgraphs. Given a graph property X , we write Xn for the number of graphs in X with vertex set {1, 2, . . . , n} and following [1] we call Xn the speed of the property X . The paper [2] identifies a jump in the speed of hereditary graph properties to the Bell number Bn an...
متن کاملUniform Number of a Graph
We introduce the notion of uniform number of a graph. The uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...
متن کاملParallel Computation of the Minimal Crossing Number of a Graph
Determining the crossing number of a graph is an important problem with applications in areas such as circuit design and network connguration. In this paper we present the rst parallel algorithm for solving this combinatorial optimization problem. This branch-and-bound algorithm, which adds and deletes crossings in an organized fashion, presents us with the opportunity to verify many conjecture...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/17m1137231